The role of the asymptotic equipartition property in noiseless source coding

نویسندگان

  • Sergio Verdú
  • Te Sun Han
چکیده

The (noiseless) fixed-length source coding theorem states that, except for outcomes in a set of vanishing probability, a source can be encoded at its entropy but not more efficiently. It is well known that the Asymptotic Equipartition Property (AEP) is a sufficient condition for a source to be encodable at its entropy. This paper shows that the AEP is necessary for the source coding theorem to hold for nonzero-entropy finite-alphabet sources. Furthermore, we show that a nonzero-entropy finitealphabet source satisfies the direct coding theorem if and only if it satisfies the strong converse. In addition, we introduce the more general setting of nonserial information sources which need not put out strings of symbols. In this context, which encompasses the conventional serial setting, the AEP is equivalent to the validity of the strong coding theorem. Fundamental limits for data compression of nonserial information sources are shown based on the flat-top property—a new sufficient condition for the AEP.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum sources and a quantum coding theorem

We define a large class of quantum sources and prove a quantum analog of the asymptotic equipartition property. Our proof relies on using local measurements on the quantum source to obtain an associated classical source. The classical source provides an upper bound for the dimension of the relevant subspace of the quantum source, via the Shannon-McMillan noiseless coding theorem. Along the way ...

متن کامل

On principles of large deviation and selected data compression

The Shannon Noiseless coding theorem (the data-compression principle) asserts that for an information source with an alphabet X = {0, . . . , ` − 1} and an asymptotic equipartition property, one can reduce the number of stored strings (x0, . . . , xn−1) ∈ X n to `nh with an arbitrary small error-probability. Here h is the entropy rate of the source (calculated to the base `). We consider furthe...

متن کامل

Generalized Source Coding Theorems and Hypothesis Testing: Part Ii { Operational Limits

In light of the information measures introduced in Part I, a generalized version of the Asymp-totic Equipartition Property (AEP) is proved. General xed-length data compaction and data compression (source coding) theorems for arbitrary nite-alphabet sources are also established. Finally, the general expression of the Neyman-Pearson type-II error exponent subject to upper bounds on the type-I err...

متن کامل

Lossless coding through the concentration of measure phenomenon

The lossless codification of stationary memoryless binary sources using block coding is studied with the additional constraint of requiring only two codeword lengths. The fundamental coding scheme of Shannon based on the asymptotic equipartition property shows the existence of block codes of this type with average codeword lengths per source output converging to the binary entropy as the block ...

متن کامل

Properties of a Word-Valued Source with a Non-prefix-free Word Set

Recently, a word-valued source has been proposed as a new class of information source models. A word-valued source is regarded as a source with a probability distribution over a word set. Although a word-valued source is a nonstationary source in general, it has been proved that an entropy rate of the source exists and the Asymptotic Equipartition Property (AEP) holds when the word set of the s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 43  شماره 

صفحات  -

تاریخ انتشار 1997